Priority queueing with finite buffer size and randomized push-out mechanism
نویسندگان
چکیده
منابع مشابه
A Finite Buffer Two Class Queue with Different Scheduling and Push-Out Schemes
We analyze an MI, M2/G1,G2/1/N queue with different scheduling and push-out scheme in this paper. Our work is motivated by the study of the performance of an output link of ATM switches with two-class priority traffics. The queueing model developed in this paper is more general than that of the output link of ATM switches with two-class priority traffics. We can have general service time distri...
متن کاملAnalysis of a Finite Buffer Queue with Different Scheduling and Push-Out Schemes
A queueing system M1, M 2 / G 1, G 2 / 1 / N with different scheduling and push-out scheme is analyzed in this paper. This work is motivated by the study of the performance of an output link of ATM switches with traffic of two classes with different priorities. However, the queueing model developed in this paper is more general than that of the output link of ATM switches with two-class priorit...
متن کاملA Queueing Model of a Bufferless Synchronous Clos ATM Switch with Head-of-Line Priority and Push-Out
We consider a synchronized bufferless Clos ATM switch with input cell processor queues. The arrival process to each input port of the switch is assumed to be bursty and it is modeled by an Interrupted Bernoulli Process. Two classes of cells are considered. Service in an input cell processor queue is head-of-line without preemption. In addition, push-out is used. That is, a high priority cell ar...
متن کاملResearch Article Delay Analysis of an M/G/1/K Priority Queueing System with Push-out Scheme
This paper considers an M/G/1/K queueing system with push-out scheme which is one of the loss priority controls at a multiplexer in communication networks. The loss probability for the model with push-out scheme has been analyzed, but the waiting times are not available for the model. Using a set of recursive equations, this paper derives the LaplaceStieltjes transforms (LSTs) of the waiting ti...
متن کاملWaiting times of the Multiple Priority Dual Queue with Finite Buffer and Non- Preemptive Priority Scheduling
This paper considers a novel queueing model called the Multi-Priority Dual Queue (MPDQ), which was introduced and analyzed in Bedford and Zeephongsekul [1, 2]. The MPDQ consists of two queues with a finite buffer, the primary and the secondary queue with the additional feature of a priority scheme to assist with congestion control and meeting Quality of Service ( ) QoS objectives for differenti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2003
ISSN: 0163-5999
DOI: 10.1145/885651.781079